type unique.entry

12 uses

	unique (current package)
		canonmap.go#L113: 	var oldEntry *entry[T]
		canonmap.go#L145: func (m *canonMap[T]) expand(oldEntry, newEntry *entry[T], newHash uintptr, hashShift uint, parent *indirect[T]) *node[T] {
		canonmap.go#L261: func (n *node[T]) entry() *entry[T] {
		canonmap.go#L265: 	return (*entry[T])(unsafe.Pointer(n))
		canonmap.go#L308: type entry[T comparable] struct {
		canonmap.go#L310: 	overflow atomic.Pointer[entry[T]] // Overflow for hash collisions.
		canonmap.go#L315: func newEntryNode[T comparable](key T, hash uintptr) (*entry[T], *T, weak.Pointer[T]) {
		canonmap.go#L319: 	return &entry[T]{
		canonmap.go#L329: func (e *entry[T]) lookup(key T) (*T, weak.Pointer[T]) {
		canonmap.go#L341: func (e *entry[T]) hasWeakPointer(wp weak.Pointer[T]) bool {
		canonmap.go#L354: func (e *entry[T]) prune() *entry[T] {